Rectangle Attack Against Type‐I Generalized Feistel Structures
نویسندگان
چکیده
Type-I generalized Feistel networks (GFN) are widely used frameworks in symmetric-key primitive designs such as CAST-256 and Lesamnta. Different from the extensive studies focusing on specific block cipher instances, analysis against GFN structures gives generic security evaluation of basic concentrates more effect linear transformation. Currently, works this field mainly evaluate impossible differential attack, zero-correlation meet-in-the-middle attack yoyo game while its rectangle is still missing. In paper, we filled gap gave first structural analytical results attack. By exploiting properties, proved there exists a boomerang switch for time, which independent round functions. Then turned into chosen plaintext setting proposed new model. appending 1 beginning switch, constructed distinguisher key recovery could be performed.
منابع مشابه
Quantum Key-recovery Attack on Feistel Structures
Post-quantum cryptography has attracted much attention from worldwide cryptologists. At Asiacrypt 2017, Leander and May combines Grover and Simon algorithms to quantumly break FX-based block ciphers. In this paper, we study the Feistel constructions with Grover and Simon algorithms and give some new quantum key-recovery attacks on different rounds of Feistel constructions. Our attacks requires ...
متن کاملType 1.x Generalized Feistel Structures
We formalize the Type 1.x Generalized Feistel Structure (GFS) in order to fill the gap between Type 1 and Type 2 GFSs. This is a natural extension of Type 1 and Type 2 GFSs, and covers them as special cases. The diffusion property of GFS is known to vary depending on the permutation used in the round function. When we have two non-linear functions in one round, we propose a permutation that has...
متن کاملOn Generalized Feistel Networks
We prove beyond-birthday-bound security for most of the well-known types of generalized Feistel networks: (1) unbalanced Feistel networks, where the n-bit to m-bit round functions may have n ̸= m; (2) alternating Feistel networks, where the round functions alternate between contracting and expanding; (3) type-1, type-2, and type-3 Feistel networks, where n-bit to n-bit round functions are used t...
متن کاملImproving the Generalized Feistel
The generalized Feistel structure (GFS) is a generalized form of the classical Feistel cipher. A popular version of GFS, called TypeII, divides a message into k > 2 sub blocks and applies a (classical) Feistel transformation for every two sub blocks, and then performs a cyclic shift of k sub blocks. Type-II GFS has many desirable features for implementation. A drawback, however, is its low diff...
متن کاملGeneric Key Recovery Attack on Feistel Scheme
We propose new generic key recovery attacks on Feistel-type block ciphers. The proposed attack is based on the all subkeys recovery approach presented in SAC 2012, which determines all subkeys instead of the master key. This enables us to construct a key recovery attack without taking into account a key scheduling function. With our advanced techniques, we apply several key recovery attacks to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese Journal of Electronics
سال: 2022
ISSN: ['1022-4653', '2075-5597']
DOI: https://doi.org/10.1049/cje.2021.00.058